Resource convertibility and ordered commutative monoids
نویسندگان
چکیده
منابع مشابه
Corrigendum: Residuation in Commutative Ordered Monoids with Minimal Zero
The assertional logic S(BCIA) of the quasivariety of BCI-algebras (in Iseki's sense) is axiomatized, relative to pure implicational logic BCI, by the rule x, y, x → y (G) (see [1]). Alternatively, the role of (G) can be played by x x → (y → y) (1) (see [2]). The formula (x → x) → (y → y) (2) is a theorem of S(BCIA). In [2, Proposition 22] we claimed erroneously that, relative to BCI, the axiom ...
متن کاملOrdered monoids and J-trivial monoids
In this paper we give a new proof of the following result of Straubing and Thérien: every J -trivial monoid is a quotient of an ordered monoid satisfying the identity x ≤ 1. We will assume in this paper that the reader has a basic background in finite semigroup theory (in particular, Green’s relations and identities defining varieties) and in computer science (languages, trees, heaps). All semi...
متن کاملPartially Commutative Inverse Monoids
Free partially commutative inverse monoids are investigated. Analogously to free partially commutative monoids (trace monoids), free partially commutative inverse monoids are the quotients of free inverse monoids modulo a partially defined commutation relation on the generators. A quasi linear time algorithm for the word problem is presented, more precisely, we give an O(n log(n)) algorithm for...
متن کاملStrongly Homotopy-Commutative Monoids Revisited
We prove that the delooping, i. e., the classifying space, of a grouplike monoid is an H-space if and only if its multiplication is a homotopy homomorphism, extending and clarifying a result of Sugawara. Furthermore it is shown that the Moore loop space functor and the construction of the classifying space induce an adjunction of the according homotopy categories. 2000 Mathematics Subject Class...
متن کاملOn Presentations of Commutative Monoids
In this paper, all the monoids considered are commutative. If S is a monoid generated by {m1, . . . ,mn}, then S is isomorphic to a quotient monoid of N by the kernel congruence σ of the map φ : N → S, φ(k1, . . . , kn) = ∑n i=1 kimi. Under this setting, a finite presentation for S is a finite subset ρ of Nn×Nn such that the congruence generated by ρ is equal to σ. Rédei proves in [5] that ever...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Structures in Computer Science
سال: 2015
ISSN: 0960-1295,1469-8072
DOI: 10.1017/s0960129515000444